Distributed Averaging Using Periodic Gossiping
نویسندگان
چکیده
منابع مشابه
Periodic gossiping on trees
In periodic gossip schemes, the calls are periodically repeated according to a proper coloring of the edges of the underlying graph with integers 1; 2;. .. ; c. One period consists of c consecutive rounds 1;. .. ; c each containing time-parallel bidirectional calls on all edges with the same color. The problem is to design colorings which minimize the number of periods until gossiping is comple...
متن کاملQuasi - Periodic Frequency Analysis Using Averaging
We present a new approach to the numerical computation of the basic frequencies of a quasiperiodic signal. Although a complete toolkit for frequency analysis is presented, our methodology is better understood as a refinement process for any of the frequencies, provided we have a rough approximation of the frequency that we wish to compute. The cornerstone of this work is a recently developed me...
متن کاملDecentralized Sensor Fusion using Periodic Peer-to-Peer Hypercube Gossiping
Fusion marks the aggregation of information from multiple sources, yielding a result that is more valuable than information from any source alone. The fusion of live sensor streaming data is characterized by the ongoing aggregation of series of measurements. It has applications in areas ranging from audio communications, to business process monitoring, to live object tracking to shared haptic v...
متن کاملEpistemic Protocols for Distributed Gossiping
Gossip protocols aim at arriving, by means of point-to-point or group communications, at a situation in which all the agents know each other’s secrets. We consider distributed gossip protocols which are expressed by means of epistemic logic. We provide an operational semantics of such protocols and set up an appropriate framework to argue about their correctness. Then we analyze specific protoc...
متن کاملOn Periodic Gossiping with an Optimal Weight
By the distributed averaging problem is meant the problem of computing the average value ȳ of a set of numbers possessed by the agents in a distributed network using only communication between neighboring agents. Gossiping is a well-known approach to the problem which seeks to iteratively arrive at a solution by allowing each agent to interchange information with at most one neighbor at each it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2017
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2017.2688278